An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
نویسندگان
چکیده
منابع مشابه
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT is well-suited for generating large, random prime numbers since on a random input number, it takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability. EQFT extends QFT by verifying additional algeb...
متن کاملA Simpli ed Quadratic Frobenius Primality Test
The publication of the quadratic Frobenius primality test [6] has stimulated a lot of research, see e.g. [4, 10, 11]. In this test as well as in the Miller-Rabin test [13], a composite number may be declared as probably prime. Repeating several tests decreases that error probability. While most of the above research papers focus on minimising the error probability as a function of the number of...
متن کاملAverage Case Error Estimates for the Strong Probable Prime Test
Consider a procedure that chooses fe-bit odd numbers independently and from the uniform distribution, subjects each number to t independent iterations of the strong probable prime test (Miller-Rabin test) with randomly chosen bases, and outputs the first number found that passes all t tests. Let pfc , denote the probability that this procedure returns a composite number. We obtain numerical upp...
متن کاملError estimates for linear-quadratic control problems with control constraints
An abstract linear-quadratic optimal control problem with pointwise control constraints is investigated. This paper is concerned with the discretization of the control by piecewise linear functions. Under the assumption that the optimal control and the optimal adjoint state are Lipschitz continuous and piecewise of class C an approximation of order h is proved for the solution of the control di...
متن کاملAn Introduction to the AKS Primality Test
Input: An integer n > 1. 0: if n is a power then output composite fi; 1: r := 2; 2: while (r < n) do 3: if gcd(r, n) 6= 1 then output composite fi; 4: if r is prime then 5: q := largest prime factor of r − 1; 6: if (q ≥ 4√r log n) and (n(r−1)/q 6≡ 1 mod r) then break fi; 7: fi; 8: r := r + 1; 9: od; 10: for a = 1 to 2 √ r log n do 11: if (x− a)n 6≡ (xn − a) mod (xr − 1, n) then output composite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2001
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v8i45.21705